Kernelization for cycle transversal problems
نویسندگان
چکیده
منابع مشابه
Kernelization for Cycle Transversal Problems
We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k kernel for 4-cycle transversal and a O(k) kernel for s-cycle transversal when s > 4. We prove the NP-completeness of s-cycle transversal on planar graphs and obtain a 74k kernel for 4-cycle transversal on planar graphs. We also give several kernelization results for a related problem ...
متن کاملKernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d ≥ 3 is the problem of nding a matching of size at least k in a given d-uniform hypergraph and has kernels with O(k) edges. Recently, Bodlaender et al. [ICALP 2008], Fortnow and Santhanam [STOC 2008], Dell...
متن کاملKernelization Algorithms for d-Hitting Set Problems
A kernelization algorithm for the 3-Hitting-Set problem is presented along with a general kernelization for d-Hitting-Set problems. For 3-Hitting-Set, a quadratic kernel is obtained by exploring properties of yes instances and employing what is known as crown reduction. Any 3-Hitting-Set instance is reduced into an equivalent instance that contains at most 5k + k elements (or vertices). This ke...
متن کاملParallel algorithms for generalized clique transversal problems
The K `-clique transversal problem is to locate a minimum collection of cliques of size ` in a graph G such that every maximal clique of sizè in G contains at least one member of the collection. We give an NC algorithm to solve this problem on strongly chordal graphs.
متن کاملDiminishable Parameterized Problems and Strict Polynomial Kernelization
Kernelization—a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems—plays a central role in parameterized complexity and has triggered an extensive line of research. This is in part due to a lower bounds framework that allows to exclude polynomial-size kernels under the assumption of NP * coNP/poly. In this paper we consider a restricted yet natural...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.12.024